An Interactive Driver for Goal-directed Proof Strategies

نویسندگان

  • Andrea Asperti
  • Enrico Tassi
چکیده

Interactive Theorem Provers (ITPs) are tools meant to assist the user during the formal development of mathematics. Automatic proof searching procedures are a desirable aid, and most ITPs supply the user with an extensive set of facilities to improve automation. However, the black-box nature of most automatic procedure conflicts with the interactive nature of these tools: a newcomer running an automatic procedure learns nothing by its execution (especially in case of failure), and a trained user has no opportunities to interactively guide the procedure towards the solution, e.g. pruning wrong or not promising branches of the search tree. In this paper we discuss the implementation of the resolution based automatic procedure of the Matita ITP, explicitly conceived to be interactively driven by the user through a suitable, simple graphical interface.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Head-tactics Optimization

Tactics are commands used to guide goal-directed proofs in interactive proof environments. This paper presents various possible sim-pliications on tactic expression and provides a justiication for these simpliications, based on a precise description of the way tactics operate. In particular, this paper introduces a class of head-oriented tactics that are especially suited for optimization. Most...

متن کامل

Cooperative Control of Mobile Robots in Creating a Runway Platform for Quadrotor Landing

Multi-agent systems are systems in which several agents accomplish a mission in a cooperative manner. In this paper, a novel idea for the construction of a movable runway platform based on multi-agent systems is presented. It is assumed that an aerial agent (quadrotor) decides to make an emergency landing due to reasons such as a decrease in energy level or technical failure, while there is no ...

متن کامل

Proof Search in an Authorization Logic

We consider the problem of proof search in an expressive authorization logic that contains a “says” modality and an ordering on principals. After a description of the proof system for the logic, we identify two fragments that admit complete goal-directed and saturating proof search strategies. A smaller fragment is then presented, which supports both goal-directed and saturating search, and has...

متن کامل

Igloo | a Graphic Supported Proof Development System

Whenever deductive approaches for particular problems are pursued with the goal of a real implementation the question of how to obtain suucient ee-ciency arises. General purpose proof procedures are not the right means because their demand on completeness is often contradicting the requests of systems with real time behaviour. The paradigm of tactical theorem proving ooers a way to implement sp...

متن کامل

A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems

Basic proof search tactics in logic and type theory can be seen as the rootrst applications of rules in an appropriate sequent calculus, preferably without the redundancies generated by permutation of rules. This paper addresses the issues of de ning such sequent calculi for Pure Type Systems (PTS, which are based on natural deduction) and then organizing their rules for effective proof search....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 226  شماره 

صفحات  -

تاریخ انتشار 2009